Distributed Submesh Determination in Faulty Tori and Meshes
نویسندگان
چکیده
Torus/mesh-based machines have received increasing attention. It is natural to identify the maximum healthy submeshes in a faulty torus/mesh so as to lower potential performance degradation, because the time for executing a parallel algorithm tends to depend on the size of the assigned submesh. This paper proposes an efficient approach for identifying all the maximum healthy submeshes present in a faulty torus/mesh. The proposed approach is based on manipulating set expressions, with the search space reduced considerably by taking advantage of the interesting properties of a faulty torus/mesh.
منابع مشابه
Embedding of rings in 2-D meshes and tori with faulty nodes
To increase the reliability of networks embedded in meshes or tori and to allow their use in the presence of faulty nodes, efficient fault-tolerant schemes in meshes and tori are necessary. In this paper, we present algorithms for embedding a ring in a mesh-type and torus-type multiprocessor networks in the event of node failures. In our approach, a mesh or torus is partitioned into 4 4 submesh...
متن کاملART: Robustness of Meshes and Tori for Parallel and Distributed Computation
In this paper, we formulate the array robustness theorems (ARTs) for efficient computation and communication on faulty arrays. No hardware redundancy is required and no assumption is made about the availability of a complete submesh or subtorus. Based on ARTs, a very wide variety of problems, including sorting, FFT, total exchange, permutation, and some matrix operations, can be solved with a s...
متن کاملFault-Tolerant Meshes and Tori Embedded in a Faulty Supercube
Hypercubes, meshes, and tori are well known interconnection networks for parallel computing. The Supercube network is a generalization of the hypercube. The main advantage of this network is that it has the same connectivity and diameter as that of the hypercube without the constraint that the number of nodes be a power of 2. This paper proposes novel algorithms of fault-tolerant meshes and tor...
متن کاملFault-Tolerant Adaptive and Minimal Routing in Mesh-Connected Multicomputers Using Extended Safety Levels
ÐThe minimal routing problem in mesh-connected multicomputers with faulty blocks is studied, Two-dimensional meshes are used to illustrate the approach. A sufficient condition for minimal routing in 2D meshes with faulty blocks is proposed. Unlike many traditional models that assume all the nodes know global fault distribution, our approach is based on the concept of an extended safety level, w...
متن کاملIrreversible Dynamos in Tori
We study the dynamics of majority-based distributed systems in presence of permanent faults. In particular, we are interested in the patterns of initial faults which may lead the entire system to a faulty behaviour. Such patterns are called dynamos and their properties have been studied in many diierent contexts. In this paper we investigate dynamos for meshes with diierent types of toroidal cl...
متن کامل